A Hybrid Genetic Search for Graph Partitioning Based on Lock Gain
نویسندگان
چکیده
A new hybrid genetic algorithm for graph bisection is proposed. The algorithm includes a new local optimization heuristic. Based on the traditional framework of the KernighanLin algorithm, the local optimization uses a new type of gain as the primary measure for vertex movement. The new algorithm showed signi cant or dramatic improvement over the state-of-the-art algorithms.
منابع مشابه
A Hybrid Genetic Search For Circuit Bipartitioning
The Fiduccia-Matheyses algorithm (FM) [1] is a representative iterative improvement algorithm for a hypergraph partitioning problem. But the quality of the FM is not stable. Kim and Moon [3] introduced lock gain as a primary measure for choosing the nodes to move. It uses the history of search more eÆciently. Lock gain showed excellent performance for general graphs. We adapt the lock gain for ...
متن کاملCircuit Bipartitioning Using Genetic Algorithm
In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic which is a modification of Fiduccia-Matheses algorithm. Using well-known benchmarks (including ACM/SIGDA benchmarks), the combination of genetic algorithm and the local heuristic outperformed hMetis [3], a ...
متن کاملA Hybrid Genetic Search for Multi way Graph Partitioning Based on Direct Partitioning
Multi way partitioning is an important ex tension of two way partitioning as it provides a natural and direct model for many parti tioning applications In this paper we pro pose a hybrid genetic algorithm for k way partitioning The algorithm includes an ef cient local optimization heuristic which is not based on the bisection method It con siderably outperformed existing k way parti tioning alg...
متن کاملA Hybrid Genetic Algorithm for Multiway Graph Partitioning
A hybrid genetic algorithm for multiway graph partitioning is proposed. The algorithm includes an e cient local optimization heuristic. Starting at an initial solution, the heuristic iteratively improves the solution using cyclic movements of vertices. The suggested heuristic performed well in itself and as a local optimization engine in the hybrid genetic algorithm. Combined with the framework...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000